Branch-and-Bound Global-Search Algorithm for Aircraft Ground Movement Optimization
نویسندگان
چکیده
Optimal aircraft ground scheduling is a well known NP-Hard problem and hence many heuristics are used to generate schedules within realistic run-times. These heuristics are designed to run fast, but often do not promise any guarantee about the solution quality. Inspired from the railway scheduling algorithms by D’Ariano et al.[1] and Mannino et al.[2], this paper introduces a Branch & Bound based aircraft routing and scheduling approach with guaranteed global optimality; as a real-time decision support tool for Air Traffic Controllers.
منابع مشابه
GROUND MOTION CLUSTERING BY A HYBRID K-MEANS AND COLLIDING BODIES OPTIMIZATION
Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA Global Optimization Algorithm for Nonconvex Generalized Disjunctive Programming and Applications to Process Systems
Abstract A global optimization algorithm for nonconvex Generalized Disjunctive Programming (GDP) problems is proposed in this paper. By making use of convex underestimating functions for bilinear, linear fractional and concave separable functions in the continuous variables, the convex hull of each nonlinear disjunction is constructed. The relaxed convex GDP problem is then solved in the first ...
متن کاملNode Selection Heuristics Using the Upper Bound in Interval Branch and Bound
We present in this article a new strategy for selecting the current node in an interval Branch and Bound algorithm for constrained global optimization. The standard best-first strategy selects the node with the lowest lower bound of the objective estimate. We propose in this article new node selection policies where an upper bound of each node/box is also taken into account. The good accuracy o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Aerospace Inf. Sys.
دوره 14 شماره
صفحات -
تاریخ انتشار 2017